Solving the winner determination problem with discounted bids in transportation auctions
نویسندگان
چکیده
Abstract Continuing advances in modern technologies have transformed the procedure of transportation procurement through auctions supply chain management (SCM). This study examines online combinatorial auction (CA), which serves customers placed at nodes a network, with particular consideration given to carbon emissions. The CA mechanism allows early shipments carriers improve their load consolidation and reduce repositioning trips. Sustainability emissions are considered by prioritizing carrier’s reduction performances. Two models examined under emission regulations (Carbon tax Cap-and-offset) choose winners CA. Our aim is minimize cost incorporating green reputation-based winner determination problem within model. Computational experiments reveal positive impact prioritization discounted offers reducing both costs number empty Indeed, our results show introduction bids about 2% for shipper 24% movements, on average, carriers.
منابع مشابه
A two-stage stochastic model for the winner determination problem in transportation procurement auctions
We propose a service-oriented combinatorial auction mechanism in an uncertain context where a shipper needs to outsource its transport operations to external carriers. Uncertainty is on shipper demand, carrier capacity and carrier lead time. A two-stage stochastic formulation is proposed to model the winner determination problem. A Monte Carlo approach combined with the sample average approxima...
متن کاملA Robust Winner Determination Problem for Combinatorial Transportation Auctions under Uncertain Shipment Volumes
Combinatorial auctions are widely used for the procurement of transportation services. In these auctions, shippers act as auctioneers who need to outsource a number of transportation services to external carriers. Carriers compete by submitting bids on packages of shippers' requests. After receiving all carriers' bids, the shipper solves the well-known winner determination problem (WDP) in orde...
متن کاملParameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions (CAs) have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are self-interested. One challenge, however, is that the winner-determination problem (WDP) for combinatorial auctions is NP-hard in the general case. However, there are ways to leverage meaningful structure in the ...
متن کاملSolving a bi-objective winner determination problem in a transportation procurement auction
This paper introduces a bi-objective winner determination problem which arises in the procurement of transportation contracts via combinatorial auctions. The problem is modelled as an extension to the set covering problem and considers the minimisation of the total procurement costs and the maximisation of the service-quality level of the execution of all transportation contracts tendered. To s...
متن کاملA Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions
We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by applying subgradient optimization with variable fixing. A number of different bid ordering and selection rules are used in our heuristic. Moreover, an effective local search refinement procedure is presented at the end of our algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2023
ISSN: ['1572-9338', '0254-5330']
DOI: https://doi.org/10.1007/s10479-023-05457-5